Computer Shopper 125/Computer Shopper CD-ROM Issue 125 (1998-07)(Dennis Publishing).iso/EuroMath/MathDemo/DataBase/Question/ID159.txt

Text File | 1997-09-04 | 10.4 KB | 557 lines

 '(O)o(O)o(O)o(O)o(O)o(O)o(O)o(O)o(O)o(O)o(O)
'o(O)
'(O)o
'o(O)        n0107 - Question A
'(O)o
'o(O)        Lowest Common Multiple
'(O)o
'o(O)
'(O)o(O)o(O)o(O)o(O)o(O)o(O)o(O)o(O)o(O)o(O)


@WeightingScore 9,1,1,1

@atGraphic 36,14
@Picture numbers\n0107a.bmp

@at 100,20
Find the #blowest common #
#bmultiple# of the following
numbers:
@at 10,+8
      #^             #^   #p8#         #^  #p12#         #^  #p16#

@at 10,+62
  Which method do you want to practice?
@at ,+6
   Listing the #bmultiples# of each number...
@at ,+4
   Using #bprime numbers#...

@MultMode 2
@atGraphic 214,156
@Loop 2
@HSPicture uncheck.bmp,check.bmp
@atGraphic ,172
@EndLoop

@Answer 0,2
@Feedback 0
@FBMGoto Method_2
@Answer 0,1

'||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||


@Question

@at 10,+32
What's the first step?
@at ,+3
#[K]

@keyPointAnswer 1,185,multiply by 2

@KeyPointFeedback 0,Wrong option
The first step will be to find all the
factors of each number.


'|||||||||||||||||||/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/|||||||||||||||||||||

@Question

@NewPage
@atGraphic 36,14
@Picture numbers\n0107a.bmp

@at 100,20
Find the #blowest common #
#bmultiple# of the following
numbers:
@at 10,+8
           #^        #^   #p8#          #^ #p12#          #^ #p16#

@InputWidth 20
@at ,+2
#T╫2 #T#[N]#T#[N]#T#[N]
@MarkPos 1

@Answer 1, 16,24,32

@Feedback E0.33,?,?,?
That's partly right.*
@Feedback 0,?,?,?

@FeedbackC 1,  8 ╫ 2 = #b16#
@FeedbackC 2,12 ╫ 2 = #b24#
@FeedbackC 3,16 ╫ 2 = #b32#
@FeedbackC 0,
@FeedbackC 0,Always check your answers.


'/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/

@Question

@at 10,+140
What's the next step?
@at ,+3
#[K]
@MarkPos 2

@keyPointAnswer 1,186,multiply by one more than last time

@KeyPointFeedback 0,Wrong option
Continue finding the multiples of each number
until you find the lowest common multiple,
which will appear in all three lists.


'/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/


@Question

@GoPos 1
@at ,+5
#T╫3 #T#[N]#T#[N]#T#[N]
@at ,+5
#T╫4 #T#[N]#T#[N]#T#[N]
@at ,+5
#T╫5 #T#[N]#T#[N]#T#[N]
@at ,+5
#T╫6 #T#[N]#T#[N]#T#[N]

@Answer 5, 24,36,48, 32,48,64, 40,60,80, 48,72,96

@Feedback E0.4, ?,?,?,?,?,?,?,?,?,?,?,?
@Feedback 0, ?,?,?,?,?,?,?,?,?,?,?,?

@FeedbackC 0,To find the lowest common multiple of a of
@FeedbackC 0,number, multiply them by whole numbers beginning
@FeedbackC 0,with 2, and continuing with ╫3, ╫4, ╫5, etc. until
@FeedbackC 0,there is a multiple common to all the numbers.*
@FeedbackC 0,Remember to check your answers.


'/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/

@Question

@InputWidth 26
@GoPos 1
@at 80,+80

#b       Lowest#
#bCommon Multiple#
@at ,+3
            #[N]

@Answer 1, 48

@Feedback 0,?
You should have found the lowest number in all
the lists.  #b48# is the lowest multiple common
to all three numbers.

@Feedback 1
That's right!  Well done.

@Goto End_of_Question



'<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>     METHOD 2    <\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>



@Label Method_2

@Question

@at 10,+32
What's the first step?
@at ,+3
#[K]

@keyPointAnswer 1,187,find the prime factors of each number

@KeyPointFeedback 0,Wrong option
The first step will be to find all the
prime factors of each number.


'|||||||||||||||||||/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/|||||||||||||||||||||

@NewPage
@atGraphic 36,14
@Picture numbers\n0107a.bmp

@at 100,20
Find the #blowest common #
#bmultiple# of the following
numbers:
@at 10,+8
   #^            #p8#         #^          #p12#         #^          #p16#;
#T ;
@MarkPos 1
#T#T ;
@MarkPos 2
#T#T#T ;
@MarkPos 3

@InputWidth 20
@GoPos 1
#^        #^;
@Loop 4
#T#[N];
@at ,+17
#T#T#[N];
@EndLoop

@Answer 1.5, 2,4,2,2,2,1,,

@Feedback E0.187,?,?,?,?,?,?,?,?
@Feedback 0,?,?,?,?,?,?,?,?

@FeedbackC 0,To find all the prime factors of any number,
@FeedbackC 0,first divide by the smallest prime number as
@FeedbackC 0,many times as possible.  If the number will
@FeedbackC 0,not divide evenly, divide by the next larger
@FeedbackC 0,prime number, and repeat until you are left
@FeedbackC 0,with a result of 1.


'/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/


@Label Next
@Question

@GoPos 1
@at 20,+110
The Prime Factors are...

@InputWidth 14
@GoPos 1
@at +2,+140
#[N];
@at ,-10
#[N]

@Answer 0.5, 2,3

@Feedback E0.25,?,?
@Feedback 0,?,?

@FeedbackC 0,Once you've worked out all the prime factors,
@FeedbackC 0,you should rewrite each factor once, raising
@FeedbackC 0,it to an index to show how many lots there
@FeedbackC 0,are.


'/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/

@Label Next
@Question

@InputWidth 20
@GoPos 2
#^        #^;
@Loop 4
#T#[N];
@at ,+17
#T#T#[N];
@EndLoop

@Answer 1.5, 2,6,2,3,3,1,,

@Feedback E0.187,?,?,?,?,?,?
@Feedback 0,?,?,?,?,?,?

@FeedbackC 0,To find all the prime factors of any number,
@FeedbackC 0,first divide by the smallest prime number as
@FeedbackC 0,many times as possible.  If the number will
@FeedbackC 0,not divide evenly, divide by the next larger
@FeedbackC 0,prime number, and repeat until you are left
@FeedbackC 0,with a result of 1.


'/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/


@Label Next
@Question

@InputWidth 14
@GoPos 2
@at -12,+140
#[N];
@at ,-10
#[N];
@at ,+10
 ╫ #[N];
@at ,-10
#[N]

@Answer 0.5, 2,2,3,
@Feedback 0.5
@FBMGoto Next
@Answer 0.5, 3,,2,2
@Feedback 0.5
@FBMGoto Next
@Answer 0.5, 2,2,3,1
@Feedback 0.5
@FBMGoto Next
@Answer 0.5, 3,1,2,2
@Feedback 0.5
@FBMGoto Next

@Feedback E0.125,?,?,?,?
@Feedback 0,?,?,?,?

@FeedbackC 0,Once you've worked out all the prime factors,
@FeedbackC 0,you should rewrite each factor once, raising
@FeedbackC 0,it to an index to show how many lots there
@FeedbackC 0,are.

'/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/


@Label Next
@Question

@InputWidth 20
@GoPos 3
#^        #^;
@Loop 4
#T#[N];
@at ,+17
#T#T#[N];
@EndLoop

@Answer 1.5, 2,8,2,4,2,2,2,1

@Feedback E0.187,?,?,?,?,?,?,?,?
@Feedback 0,?,?,?,?,?,?,?,?

@FeedbackC 0,To find all the prime factors of any number,
@FeedbackC 0,first divide by the smallest prime number as
@FeedbackC 0,many times as possible.  If the number will
@FeedbackC 0,not divide evenly, divide by the next larger
@FeedbackC 0,prime number, and repeat until you are left
@FeedbackC 0,with a result of 1.


'/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/


@Label Next
@Question

@InputWidth 14
@GoPos 3
@at +10,+140
#[N];
@at ,-10
#[N]

@Answer 0.5, 2,4

@Feedback E0.25,?,?
@Feedback 0,?,?

@FeedbackC 0,Once you've worked out all the prime factors,
@FeedbackC 0,you should rewrite each factor once, raising
@FeedbackC 0,it to an index to show how many lots there
@FeedbackC 0,are.


'/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/

@Question

@at 10,280
Now what do you do?
@at ,+3
#[K]

@keyPointAnswer 1,188,find the product

@KeyPointFeedback 0,Wrong option
The final step is to find the product of
each unique prime factor.


'/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/

@Question

@InputWidth 20
@at 10,230
        Lowest Common Multiple  =
@at 30,+14
  #[N];
@at ,-10
#[N];
@at ,+10
  ╫  #[N];
@at ,-10
#[N];
@at ,+10
  =  #[N]

@Answer 1, 2,4,3,,48
@Feedback 1
@FBMgoto Right
@Answer 1, 3,,2,4,48
@Feedback 1
@FBMgoto Right
@Answer 1, 3,1,2,4,48
@Feedback 1
@FBMgoto Right

@Answer 1, 2,4,3,1,48

@Feedback 0.5, 2,4,3,,?
@Feedback 0.5, 2,4,3,1,?
@FBMGoto Calc

@Feedback 0,?,?,?,?,?
To find the lowest common multiple,
@Label Calc
The lowest common multiple of 8, 12 and 16 is:*
                  #b2è ╫ 3# = 16 ╫ 3 = #b48#

@Label Right
@Feedback 1
That's right!  Well done.


'<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>


@Label End_of_Question
<\/>/\<\/>/\<\/>


@Label End_of_Question
Goto Next
@Answer 0.5, 2,3,3,1

@Feedback E0.125,?,?,?,?
@Feedback 0,?,?,?,?

@FeedbackC 0,Once you've worked out all the prime factors,
@FeedbackC 0,you should rewrite each factor once, raising
@FeedbackC 0,it to an index to show how many lots there
@FeedbackC 0,are.

'/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/


@Label Next
@Question

@InputWidth 20
@GoPos 3
#^        #^;
@Loop 5
#T#[N];
@at ,+17
#T#T#[N];
@EndLoop

@Answer 1.5, 2,8,2,4,2,2,2,1,,

@Feedback E0.15,?,?,?,?,?,?,?,?,?,?
@Feedback 0,?,?,?,?,?,?,?,?,?,?

@FeedbackC 0,To find all the prime factors of any number,
@FeedbackC 0,first divide by the smallest prime number as
@FeedbackC 0,many times as possible.  If the number will
@FeedbackC 0,not divide evenly, divide by the next larger
@FeedbackC 0,prime number, and repeat until you are left
@FeedbackC 0,with a result of 1.


'/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/


@Label Next
@Question

@InputWidth 14
@GoPos 3
@at +32,+140
#[N];
@at ,-10
#[N]

@Answer 0.5, 2,4

@Feedback E0.125,?,?
@Feedback 0,?,?

@FeedbackC 0,Once you've worked out all the prime factors,
@FeedbackC 0,you should rewrite each factor once, raising
@FeedbackC 0,it to an index to show how many lots there
@FeedbackC 0,are.


'/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/

@Question

@at 10,280
Now what do you do?
@at ,+3
#[K]

@keyPointAnswer 1,188,find the product

@KeyPointFeedback 0,Wrong option
The final step is to find the product of the
highest prime factor to the highest power
common to all three numbers.


'/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/

@Question

@InputWidth 14
@at 10,240
Highest Common Factor  =  #[N];
@at ,-10
#[N];
@at ,+10
  =  #[N]

@Answer 1, 2,3,8

@Feedback 0.5, 2,3,?
@FBMGoto Calc

@Feedback 0,?,?,?
To find the highest common factor of a given
number, you take only the prime factors which
are in all of the lists, in this case 2. If the prime factors
are raised to an index, you should take the lowest.
In this case the highest common power of 2 is 3._
@Label Calc
The highest common factor of 48, 24 and 16 is:*
                  #b2ë = 8#

@Feedback 1
That's right!  Well done.


'<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>/\<\/>


@Label End_of_Question
on
on